A method for obtaining lower bounds on the higher order nonlinearity of Boolean function

نویسنده

  • Mikhail Lobanov
چکیده

Obtainment of exact value or high lower bound on the r-th order nonlinearity of Boolean function is a very complicated problem (especial if r > 1). In a number of papers lower bounds on the r-th order nonlinearity of Boolean function via its algebraic immunity were obtain for different r. This bounds is rather high for function with maximum near maximum possible algebraic immunity. In this paper we prove theorem, which try to obtain rather high lower bound on the r-th order nonlinearity for many functions with small algebraic immunity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Lower Bounds on the Second Order Nonlinearity of Cubic Boolean Functions

It is a difficult task to compute the r-th order nonlinearity of a given function with algebraic degree strictly greater than r > 1. Even the lower bounds on the second order nonlinearity is known only for a few particular functions. We investigate the lower bounds on the second order nonlinearity of cubic Boolean functions Fu(x) = Tr( Pm l=1 μlx l), where ul ∈ F ∗ 2n , dl = 2l + 2l + 1, il and...

متن کامل

Second Order Nonlinearities of Some Classes of Cubic Boolean Functions Based on Secondary Constructions

The higher order nonlinearity of a Boolean function is a cryptographic criterion, which play a role against attacks on stream and block ciphers. Also it play a role in coding theory, since it is related to the covering radii of Reed-Muller codes. In this paper, we study the lower bounds of second-order nonlinearities of a class of cubic Boolean functions of the form with and ∈ ′ and some classe...

متن کامل

Highly Nonlinear Vector Boolean Functions

In this paper we study n-input m-output Boolean functions (abbr. (n,m)-functions) with high nonlinearity. First, we present a basic construction method for a balanced (n,m)-function based on a primitive element in GF (2m). With an iterative procedure, we improve some lower bounds of the maximum nonlinearity of balanced (n,m)-functions. The resulting bounds are larger than the maximum nonlineari...

متن کامل

Higher Order-Nonlinearities on Two Classes of Boolean Functions

we compute the lower bounds on higherorder nonlinearities of monomial partial-spreads type bent Boolean function ), ( ) ( 1 2 1 2  n x Tr x f n   where , , * 2 2 n n F F x    n is an even positive integer and inverse Boolean function ), ( ) ( 2 2 1   n x Tr x g n   where , , * 2 2 n n F F x    n is any positive integer. We also show that our lower bounds are better then the Carlet...

متن کامل

On the lower bounds of the second order nonlinearities of some Boolean functions

The r-th order nonlinearity of a Boolean function is an important cryptographic criterion in analyzing the security of stream as well as block ciphers. It is also important in coding theory as it is related to the covering radius of the Reed-Muller code R(r, n). In this paper we deduce the lower bounds of the second order nonlinearity of the following two types of Boolean functions: 1. fλ(x) = ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2013  شماره 

صفحات  -

تاریخ انتشار 2013